import java.util.Arrays;
import java.util.Scanner;

public class 数组的排序 {
	public static void main(String[] args) {
		var sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n + 10];
		for(int i = 1; i <= n; i ++ ) {
			a[i] = sc.nextInt();
		}
		Arrays.sort(a, 1, n + 1); // 注意这个排序 也是前闭后开的
		for(int i = 1; i <= n; i ++ ) {
			System.out.print(a[i] + " ");
		}
	}
}

class pair implements Comparable<pair> {

	int x, y;
	
	// 按照x从小到大排序的
	@Override
	public int compareTo(pair o) {
		return this.x - o.x;
	}
	
}
